Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem
نویسندگان
چکیده
منابع مشابه
A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملA cellular learning automata-based algorithm for solving the vertex coloring problem
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.01.098 ⇑ Corresponding author. E-mail addresses: [email protected] (J. Akbari ac.ir (M.R. Meybodi). Vertex coloring problem is a combinatorial optimization problem in which a color is assigned to each vertex of the graph such that no two adjacent vertices have the same color. Cellular learning automata (CLA) is an e...
متن کاملTime optimizing in Economical Grid Using Adaptive Stochastic Petri Net Based on Learning Automata Intelligent approach in Economical Grid
in this paper, intelligent algorithm of ALATO based on Learning Automata using Adaptive Stochastic Petri Net presented to optimize the time in Economical Grid. Adaptive Stochastic Petri nets based on learning automata predicts the following optimized state through getting information from former system states and dynamic environmental reactions, makes the system current states appeared based on...
متن کاملA new memetic algorithm based on cellular learning automata for solving the vertex coloring problem
Vertex coloring problem is a combinatorial optimization problem in graph theory in which a color is assigned to each vertex of graph such that no two adjacent vertices have the same color. In this paper a new hybrid algorithm which is obtained from combination of cellular learning automata (CLA) and memetic algorithm (MA) is proposed for solving the vertex coloring problem. CLA is an effective ...
متن کاملA New Vertex Coloring Algorithm Based on Variable Action-set Learning Automata
In this paper, we propose a learning automata-based iterative algorithm for approximating a near optimal solution to the vertex coloring problem. Vertex coloring is a well-known NP-hard optimization problem in graph theory in which each vertex is assigned a color so that no two adjacent vertices have the same color. Each iteration of the proposed algorithm is subdivided into several stages, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Event Dynamic Systems
دوره 27 شماره
صفحات -
تاریخ انتشار 2017